Alternative methods for learning in CSP Solvers
نویسندگان
چکیده
This paper outlines the major features of three solvers entered in this years CPAI solver competition. The solvers shared the same underlying architecture which is described in detail in the following paper, the base solver is rjw (submitted by Richard Wallace) which Diarmuid-rndi and Diarmuid-wtdi (both submitted by Diarmuid Grimes) are built on. Furthermore the solvers all used constraint weighting as a means for identifying sources of contention in the problem. However two of the solvers (Diarmuid-rndi and Diarmuid-wtdi) used restarting to approximate sources of global difficulty, while rjw learnt local information.
منابع مشابه
Generalized NoGoods in CSPs
Although nogood learning in CSPs and clause learning in SAT are formally equivalent, nogood learning has not been as successful a technique in CSP solvers as clause learning has been for SAT solvers. We show that part of the reason for this discrepancy is that nogoods in CSPs (as standardly defined) are too restrictive. In this paper we demonstrate that these restrictions can be lifted so that ...
متن کاملProteus: A Hierarchical Portfolio of Solvers and Transformations
In recent years, portfolio approaches to solving SAT problems and CSPs have become increasingly common. There are also a number of di erent encodings for representing CSPs as SAT instances. In this paper, we leverage advances in both SAT and CSP solving to present a novel hierarchical portfolio-based approach to CSP solving, which we call Proteus, that does not rely purely on CSP solvers. Inste...
متن کاملImproving the efficiency of learning CSP solvers
Backtracking CSP solvers provide a powerful framework for search and reasoning. The aim of constraint learning is increase global reasoning power by learning new constraints to boost reasoning and hopefully reduce search effort. In this thesis constraint learning is developed in several ways to make it faster and more powerful. First, lazy explanation generation is introduced, where explanation...
متن کاملProblem Transformations and Algorithm Selection for CSPs
A constraint satisfaction problem (CSP) provides a powerful paradigm to model a large number of practical problems such as scheduling, planning, vehicle routing, configuration, network design, routing and wavelength assignment. An instance of a CSP is represented by a set of variables, each of which can be assigned a value from its domain. The assignments to the variables must be consistent wit...
متن کاملSUNNY: a Lazy Portfolio Approach for Constraint Solving
Within the context of constraint solving, a portfolio approach allows one to exploit the synergy between different solvers in order to create a globally better solver. In this paper we present SUNNY: a simple and flexible algorithm that takes advantage of a portfolio of constraint solvers in order to compute without learning an explicit model a schedule of them for solving a given Constraint Sa...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007